Structure of random 312-avoiding permutations
نویسندگان
چکیده
منابع مشابه
Number of cycles in the graph of 312-avoiding permutations
The graph of overlapping permutations is defined in a way analogous to the De Bruijn graph on strings of symbols. However, instead of requiring the tail of one permutation to equal the head of another for them to be connected by an edge, we require that the head and tail in question have their letters appear in the same order of size. We give a formula for the number of cycles of length d in th...
متن کاملPatterns in Random Permutations Avoiding
We consider a random permutation drawn from the set of 132-avoiding permutations of length n and show that the number of occurrences of another pattern σ has a limit distribution, after scaling by n where λ(σ) is the length of σ plus the number of descents. The limit is not normal, and can be expressed as a functional of a Brownian excursion. Moments can be found by recursion.
متن کاملThe Shape of Random Pattern-avoiding Permutations
We initiate the study of limit shapes for random permutations avoiding a given pattern. Specifically, for patterns of length 3, we obtain delicate results on the asymptotics of distributions of positions of numbers in the permutations. We view the permutations as 0-1 matrices to describe the resulting asymptotics geometrically. We then apply our results to obtain a number of results on distribu...
متن کاملThe Fine Structure of 321 Avoiding Permutations. the Fine Structure of 321 Avoiding Permutations
Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in enumerating permutations which have a block structure avoiding 321, and whose blocks also have such structure (recursively). Generalizations of these results ...
متن کاملThe fine structure of 321 avoiding permutations
Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in enumerating permutations which have a block structure avoiding 321, and whose blocks also have such structure (recursively). Generalizations of these results ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2015
ISSN: 1042-9832
DOI: 10.1002/rsa.20601